On quasiminimal e-degrees and total e-degrees

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

s-Degrees within e-Degrees

For any enumeration degree a let D a be the set of s-degrees contained in a. We answer an open question of Watson by showing that if a is a nontrivial Σ2-enumeration degree, then D a has no least element. We also show that every countable partial order embeds into D a.

متن کامل

The Isolated D. R. E. Degrees are Dense in the R. E. Degrees

A Turing degree a is said to isolate another degree b in the r.e. degrees if and only if a < b and there is no r.e. degree c with a < c < b. In this case b is called an isolated degree and a an isolating degree. There are of course analogous deenitions for any subsets A and B of !. If a isolates b, it follows from the Sacks density theorem that at least one of the two must fail to be r.e. When ...

متن کامل

Cupping D20 Enumeration Degrees to 0 e '

In this paper we prove that every nonzero ∆2 e-degree is cuppable to 0e by a 1-generic ∆ 0 2 e-degree (so low and nontotal) and that every nonzero ω-c.e. e-degree is cuppable to 0e by an incomplete

متن کامل

Degrees of d. c. e. reals

A real is called c.e. if it is the halting probability of a prefix free Turing machine. Equivalently, a real is c.e. if it is left computable in the sense that L(α) = {q ∈ Q : q ≤ α} is a computably enumerable set. The natural field formed by the c.e. reals turns out to be the field formed by the collection of reals of the form α− β where α and β are c.e. reals. While c.e. reals can only be fou...

متن کامل

Noncappable Enumeration Degrees Below 0'e

We prove that there exists a noncappable enumeration degree strictly below 0 0 e. Two notions of relative computability, Turing and enumeration re-ducibility, are basic to any natural ne-structure theory for the classes of computable and incomputable objects. Of the theories for the corresponding degree structures (D D D and D D D e), that for the Turing degrees is the better developed, mainly ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the American Mathematical Society

سال: 1988

ISSN: 0002-9939

DOI: 10.1090/s0002-9939-1988-0934883-8